The $q$-Hahn asymmetric exclusion process
نویسندگان
چکیده
منابع مشابه
Totally Asymmetric Exclusion Process
The algebraic structure underlying the totally asymmetric exclusion process is studied by using the Bethe Ansatz. From the properties of the algebra generated by the local jump operators, we construct explicitly the hierarchy of operators that commute with the Markov operator. The transfer matrix, which is the generating function of these operators, is shown to represent a discrete Markov proce...
متن کاملTotally asymmetric simple exclusion process
Unlike equilibrium statistical mechanics non-equilibrium statistical mechanics (NESM) has no wellestablished framework. The totally asymmetric simple exclusion process (TASEP) is one of the few models available that try to meet the challenge of describing NESM. Here TASEP is presented in its simplest version. Further two biological applications on mRNA translation and molecular motors are prese...
متن کاملHidden symmetries in the asymmetric exclusion process
We present a spectral study of the evolution matrix of the totally asymmetric exclusion process on a ring at half filling. The natural symmetries (translation, charge conjugation combined with reflection) predict only two fold degeneracies. However , we have found that degeneracies of higher order also exist and, as the system size increases, higher and higher orders appear. These degeneracies ...
متن کاملPermutation Tableaux and the Asymmetric Exclusion Process
The partially asymmetric exclusion process (PASEP) is an important model from statistical mechanics which describes a system of interacting particles hopping left and right on a one-dimensional lattice of n sites. It is partially asymmetric in the sense that the probability of hopping left is q times the probability of hopping right. In this paper we prove a close connection between the PASEP m...
متن کاملCatalan tableaux and the asymmetric exclusion process
The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are certain Ferrers (or Young) diagrams filled with some 0’s and 1’s, satisfying a certain hook condition, and are enumerated by the Catalan numbers. They form ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2016
ISSN: 1050-5164
DOI: 10.1214/15-aap1148